Predicting Run Times of Applications Using Rough Sets
نویسندگان
چکیده
Application run time estimation techniques are used in diverse domains including scheduling algorithms, estimating queue times in parallel computing environments and as performance metrics in web services. In this paper we present a novel rough sets approach to estimate application run times. We present experimental results that validate our hypothesis that rough sets provide an intuitively sound solution to the problem of application run time estimation.
منابع مشابه
Supporting the Optimisation of Distributed Data Mining by Predicting Application Run Times
There is an emerging interest in optimisation strategies for distributed data mining in order to improve response time. Optimisation techniques operate by first identifying factors that affect the performance in distributed data mining, computing/assigning a “cost” to those factors for alternate scenarios or strategies and then choosing a strategy that involves the least cost. In this paper we ...
متن کاملMultigranulation single valued neutrosophic covering-based rough sets and their applications to multi-criteria group decision making
In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...
متن کاملPredicting performance of Grid based on Rough Set
In dynamic environment, the performance is restricted by various components, so we can not determine the contribution to performanc using traditional method. In this paper, we propose a novel method for predicting the performance in Grid Computing environment. We use the concept of Reduct in Rough Set theory and history record collected during a period of time to predict the applications runtim...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملRough sets theory in site selection decision making for water reservoirs
Rough Sets theory is a mathematical approach for analysis of a vague description of objects presented by a well-known mathematician, Pawlak (1982, 1991). This paper explores the use of Rough Sets theory in site location investigation of buried concrete water reservoirs. Making an appropriate decision in site location can always avoid unnecessary expensive costs which is very important in constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003